Muller automaton

Results: 32



#Item
21Automata on Inifinite Trees Christof L¨oding Lehrstuhl Informatik 7 RWTH Aachen[removed]Aachen, Germany email: [removed]

Automata on Inifinite Trees Christof L¨oding Lehrstuhl Informatik 7 RWTH Aachen[removed]Aachen, Germany email: [removed]

Add to Reading List

Source URL: www.automata.rwth-aachen.de

Language: English - Date: 2012-05-29 10:55:51
22Methods for the Transformation of ω-Automata: Complexity and Connection to Second Order Logic Diploma Thesis (Revised Version) Christof L¨oding Supervisor: Prof. Dr. Wolfgang Thomas

Methods for the Transformation of ω-Automata: Complexity and Connection to Second Order Logic Diploma Thesis (Revised Version) Christof L¨oding Supervisor: Prof. Dr. Wolfgang Thomas

Add to Reading List

Source URL: www.automata.rwth-aachen.de

Language: English - Date: 2012-05-29 10:55:56
23Toward a Structure Theory of Regular Infinitary Trace Languages? Namit Chaturvedi?? RWTH Aachen University, Lehrstuhl f¨ ur Informatik 7, D[removed]Aachen [removed]

Toward a Structure Theory of Regular Infinitary Trace Languages? Namit Chaturvedi?? RWTH Aachen University, Lehrstuhl f¨ ur Informatik 7, D[removed]Aachen [removed]

Add to Reading List

Source URL: www.automata.rwth-aachen.de

Language: English - Date: 2014-04-16 12:46:55
24Aachen Department of Computer Science Technical Report Languages of Infinite Traces and Deterministic Asynchronous Automata

Aachen Department of Computer Science Technical Report Languages of Infinite Traces and Deterministic Asynchronous Automata

Add to Reading List

Source URL: www.automata.rwth-aachen.de

Language: English - Date: 2014-02-18 06:46:59
25A Topological Perspective on Diagnosis Andreas Bauer, ANU, Australia Abstract— We propose a topological perspective on the diagnosis problem for discrete-event systems. In an infinitary framework, we argue that the con

A Topological Perspective on Diagnosis Andreas Bauer, ANU, Australia Abstract— We propose a topological perspective on the diagnosis problem for discrete-event systems. In an infinitary framework, we argue that the con

Add to Reading List

Source URL: www.immerundewig.at

Language: English - Date: 2008-05-27 22:19:01
26Deciding the weak definability of Büchi definable tree languages∗ Thomas Colcombet1 , Denis Kuperberg2 , Christof Löding3 , and Michael Vanden Boom4 1,2 CNRS and LIAFA, Université Paris Diderot Paris, France

Deciding the weak definability of Büchi definable tree languages∗ Thomas Colcombet1 , Denis Kuperberg2 , Christof Löding3 , and Michael Vanden Boom4 1,2 CNRS and LIAFA, Université Paris Diderot Paris, France

Add to Reading List

Source URL: www.liafa.univ-paris-diderot.fr

Language: English - Date: 2013-07-10 12:10:51
27Verifying Temporal Properties without Temporal Logic BOWEN ALPERN IBM T. J. Watson Research Center and FRED B. SCHNEIDER

Verifying Temporal Properties without Temporal Logic BOWEN ALPERN IBM T. J. Watson Research Center and FRED B. SCHNEIDER

Add to Reading List

Source URL: www.cs.cornell.edu

Language: English - Date: 2001-11-26 15:52:48
28Compilation Methods of Minimal Acyclic Finite-State Automata for Large Dictionaries Jorge Gra˜ na, Fco. Mario Barcala, and Miguel A. Alonso Departamento de Computaci´ on, Facultad de Inform´

Compilation Methods of Minimal Acyclic Finite-State Automata for Large Dictionaries Jorge Gra˜ na, Fco. Mario Barcala, and Miguel A. Alonso Departamento de Computaci´ on, Facultad de Inform´

Add to Reading List

Source URL: www.cs.mun.ca

Language: English - Date: 2006-01-27 11:06:25
29Sequential Synthesis with Co-Büchi Specifications Guoqiang Wang, Alan Mishchenko, Robert Brayton, and Alberto Sangiovanni-Vincentelli EECS Dept. University of California Berkeley, California, 94720, USA {geraldw, alanmi

Sequential Synthesis with Co-Büchi Specifications Guoqiang Wang, Alan Mishchenko, Robert Brayton, and Alberto Sangiovanni-Vincentelli EECS Dept. University of California Berkeley, California, 94720, USA {geraldw, alanmi

Add to Reading List

Source URL: www.bvsrc.org

Language: English - Date: 2006-10-02 15:04:33
30Theory Comput Syst DOI[removed]s00224[removed]Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization Marcelo Arenas · Pablo Barceló · Leonid Libkin

Theory Comput Syst DOI[removed]s00224[removed]Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization Marcelo Arenas · Pablo Barceló · Leonid Libkin

Add to Reading List

Source URL: web.ing.puc.cl

Language: English - Date: 2013-04-26 05:57:02